time complexity

Compared with the classical algorithm, this algorithm is simple, with close asymptotic time complexity ( O ( n+ e~ 2/ n)).

同经典算法相比，该算法简单，时间复杂度相近（O（n+e2/n））。

Experiments show that the algorithm is of practical value and its asymptotic time complexity is O ( 1).

由于散列均匀，其渐近时间复杂度为O（1）。

The results show that our approach can build well performance model, have better accuracy and coverage, and have low time and space complexity.

结果表明，本算法能很好的从搜索日志中建立推荐模型，在测试集中具有更好的准确度和覆盖率，并具有较低的时间和空间复杂度。

Besides, some main characters of matrix link multiplication about asymptotic time complexity, space complexity and so on are analysed in detail.

分析和总结了矩阵链乘有关时间复杂度和空间复杂度等重要性质。

The proposed algorithm can overcome the drawback of CBP algorithm and its time complexity increases to.

该算法克服了CBP算法 机械选取节点进行划分的缺点,同时算法复杂度也增大到.

Methods of time complexity analysis are usually based on abstractive algorithms, rather than actual programs.

对于运行时间而言，常用的时间复杂度分析技术基于的是抽象的算法，并非实际程序。

The time complexity of this algorithm is equal to O ( nlogn+ n [ d/ 2]), if an auxiliary data structure called Delaunay Tree is used in it.

如果采用一种称为Delaunay树的数据结构来辅助点的定位，则算法的效率为O（nlogn+n[d/2]）。

While human achievements in mathematics continue to reach new levels of complexity, many of us who aren't mathematicians at heart ( or engineers by trade) may struggle to remember the last time we used calculus.

虽然人类数学成就的复杂性持续再创新高，但我们当中许多本身并非数学家(或者职业并非工程师）的人，可能很难记住我们最后一次使用微积分是什么时候了。

The time and space complexity of this algorithm was also analyzed and some possible work of conflict detection among rules was pointed out.

最后，分析其时间和空间复杂度，并指出规则冲突检测中一些可能的工作。

This method can generate the upper and the lower bounds of tasks in linear time complexity in the absence of rate constraints, and find a feasible solution of task set.

在任务集具有速率约束时，该方法能以线性时间复杂度生成任务的可调度性上下界，并确定任务集的一个可行解。

The hardware cost of this network is O ( NlogN). and the time complexity of this multicast algorithm is O ( N).

此类的网络的硬件代价为O（NlogN），此多源点多播路由算法的时间复杂度为O（N）

Because of its reduced computation complexity , this filter excels in real-time tasks.

该滤波器计算量适中,具有较好的 实时 性.

The literature of operations research and industrial engineering sometimes addresses cases of extreme complexity and difficulty.

运行研究和行业工程文献有时会专注于极端复杂和困难的例子.

This algorithm has low time complexity , and can also be implemented easily and in distributed fashion.

这个算法时间复杂度低, 容易分布式实现.

A high efficiency algorithm on which asymptotic time complexity is O ( n) on loopy moving of array element is given in this paper, and some skills and techniques are provided with Pascal language.

给出一种时间复杂度为O（n）的一维数组循环移动的高效算法，并给出用PASCAL语言实现的方法及技巧。

Third, the convergence and supremum of the algorithm were proved, and the asymptotic time complexity was analyzed;

并分析了该算法的收敛性及渐进时间复杂度；

The existing algorithm for Elliptic Curve discrete logarithm problem ( ECDLP ) is the whole index time complexity algorithm.

现有的求解 ECDLP 的算法都是全指数时间复杂度的算法.

This algorithm's time complexity is O ( N log N).

算法的时间复杂度为O（n log n）；

The time complexity of this algorithm is still linear.

算法的时间复杂度仍然是线性的.

Further its consistency time complexity and space complexity will be discussed.

分析存储、检索算法的时空复杂度.

This paper specifically demonstrates the discrete-marking principle, factors and the identified rule of self-adaptability discrete step criteria, and it also analyses the asymptotic time complexity and space complexity in auto-support generation algorithm based on discrete-marking method.

详细阐述了离散标识法的原理、影响因素、自适应性离散步长的确定准则，分析了离散标识法快速支撑生成技术的渐进时间复杂度和空间复杂度。

The asymptotic time complexity and better space complexity of this method of insertion sort are better than original ones.

这种插入排序算法不论时间复杂度还是空间复杂度，相对原2-路插入排序算法都有较好的改善。

It is proved that the time complexity of the algorithm is 0 ( AT) in general and O ( NlogN) at worst cases.

推导证明了综合算法在一般情况下的时间复杂度为O（N），最坏情况下的时间复杂度为O（NlogN）。

Because of the angle bisector is robust to noise and affected small by the rotation and scale, regions detected by the method has good stability, repeatability and low time complexity.

由于角平分线的抗噪能力强，受旋转和尺度等因素的影响较小，该方法检测得到的特征区域具有较好的稳定性和可重复性，且时间复杂度低。

The branching factor of a regular search tree has a decisive effect on the time complexity of a search algorithm.

正则搜索树的分支因数对算法的复杂度有决定性影响。

This paper also shows the time and space complexity of the auto waves approach. Finally, experiments on solving TSP are presented.

本文还对所提出方法的时间和空间的复杂度给出了说明，最后大量的实验算例证明了本文方法的正确性和有效性。

The algorithm can decompose a complex planar polygon with nesting holes, and its time complexity is O ( nlogn) by analysis and testing.

该算法能够分解内嵌多个环的复杂多边形，分析及测试表明，其时间复杂度为O（nlogn）。

An improved algorithm of node refinement scheme called endpoint triangle's circumcircle method ( ETCM) is proposed, which has a linear time complexity.

本文提出了一种改进的细分嵌入算法&端点外接圆法（ETCM），该算法具有线性时间复杂度。

The experimental result shows that the algorithm can reduce time and space complexity effectively on the basis of ensuring the biology sensitivity.

对3种算法对比实验表明，该算法在保证其生物敏感性的基础上，有效地降低了时间和空间复杂度。

The Central TV Transmission Tower in Beijing with a height of 405m is mainly a prestressed concrete structure designed according to earthquake intensity 9.It has the peculiarities of complexity in structure and extreme difficulty in construction with urgent construction time limit and high construction quality demanded.

北京中央电视发射塔的设计塔高为405m，该塔采用预应力混凝土结构，按9度地震设防，结构复杂，工期紧迫，质量要求高，施工难度较大。